A Performance-Driven I/O Pin Routing Algorithm

نویسندگان

  • Dongsheng Wang
  • Ping Zhang
  • Chung-Kuan Cheng
  • Arunabha Sen
چکیده

This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorithm is proposed. In this phase, an exponential weight function is used to guide the flow distribution which is very helpful in distributing wires, globally and uniformly, on the whole routing area. Then a physical routing phase is applied to implement one-to-one connection between chip pads and I/O pins, which focuses on the wire uniformity of the fanout area nearby the periphery of chip pads. Finally, a balanced position based wire polishing approach is proposed to further improve the local wire uniformity which tries to modify each wire into a smooth curve instead of broken line while satisfying the specified design rules such as wire-wire pitch and wire-pin pitch. A routing cost function is adequately defined to guide the whole routing process, which leads to a good trade-off between wire uniformity and wire length. The algorithm has been implemented and tested on up to 10-ring 600-pin PGA and the experimental results are very promising.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detailed Routing of Multi-Terminal Nets in FPGAs

We present a multi-terminal routing algorithm for fieldprogrammable gate arrays (FPGAs). The routing problem for the FPGAs is dificult due to the preplaced routing segments that can be connected only by the pre-existing switches. We describe a sequential router that routes multiterminal nets in a single stage, i.e., global routing is not required. The multi-terminal routing greatly reduces the ...

متن کامل

A New Multi-Objective Inventory-Routing Problem by an Imperialist Competitive Algorithm

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

متن کامل

VLSI Interconnect Performance Optimization and Planning A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY JIANG HU IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

Under the sustained progress in VLSI technology, interconnect wires become increasingly important to system performance. This thesis presents research work on several aspects of VLSI interconnect performance optimization, namely, single-net performance driven routing, routing in the presence of buffer blockages and bays, performance driven multi-net global routing and interconnect planning. Sin...

متن کامل

Pin assignment for multi-FPGA systems

Multi-FPGA systems have tremendous potential, providing a high-performance computing substrate for many different applications. One of the keys to achieving this potential is a complete, automatic mapping solution that creates high-quality mappings in the shortest possible time. In this paper we consider one step in this process, the assignment of inter-FPGA signals to specific I/O pins on the ...

متن کامل

A PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows

Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999